Remarks and Replies A Simple Proof

نویسنده

  • William J. Idsardi
چکیده

Adapting arguments from Eisner 1997, 2000, this remark provides a simple proof that the generation problem for Optimality Theory (Prince and Smolensky 2004) is NP-hard. The proof needs only the binary evaluation of constraints and uses only constraints generally employed in the Optimality Theory literature. In contrast, rule-based derivational systems are easily computable, belonging to the class of polynomialtime algorithms, P (Eisner 2000).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical Remarks on “Mystical Aesthetics” The Case of Persian Painting

There are several texts pertaining to Perisian painting which explain its aesthetics on the basis of mysticism and the notion of imaginal world. This point of view bears some methodological problems. Some of the prominent scholars (Corbin, Burckhardt, Nasr, Ringgenberg et al.) refering to Ibn ‘Arabi’s mystical notions, have tried to show that the specific aesthetics o...

متن کامل

Remarks and Replies Evaluating the Complexity of Optimality Theory

Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is ‘‘in general computationally intractable’’ on the basis of a proof adapted from Eisner 1997a. We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT), and second, the result crucial...

متن کامل

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

متن کامل

Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs

Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...

متن کامل

Some notes on ``Common fixed point of two $R$-weakly commuting mappings in $b$-metric spaces"

Very recently, Kuman et al. [P. Kumam, W. Sintunavarat, S. Sedghi, and N. Shobkolaei. Common Fixed Point of Two $R$-Weakly Commuting Mappings in $b$-Metric Spaces. Journal of Function Spaces, Volume 2015, Article ID 350840, 5 pages] obtained some interesting common fixed point results for two mappings satisfying generalized contractive condition in $b$-metric space without the assumption of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006